TSTP Solution File: SWV435^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV435^4 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 10:34:34 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV435^4 : TPTP v8.1.2. Released v3.6.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:59:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513
% 0.15/0.39 % (5750)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.39 % (5753)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.39 % (5751)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (5748)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.39 % (5752)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (5749)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.39 % (5754)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.39 % (5755)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.39 % (5751)Instruction limit reached!
% 0.15/0.39 % (5751)------------------------------
% 0.15/0.39 % (5751)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5751)Termination reason: Unknown
% 0.15/0.39 % (5751)Termination phase: Property scanning
% 0.15/0.39 % (5752)Instruction limit reached!
% 0.15/0.39 % (5752)------------------------------
% 0.15/0.39 % (5752)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5752)Termination reason: Unknown
% 0.15/0.39 % (5752)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (5752)Memory used [KB]: 1023
% 0.15/0.39 % (5752)Time elapsed: 0.004 s
% 0.15/0.39 % (5752)Instructions burned: 3 (million)
% 0.15/0.39 % (5752)------------------------------
% 0.15/0.39 % (5752)------------------------------
% 0.15/0.39
% 0.15/0.39 % (5751)Memory used [KB]: 1023
% 0.15/0.39 % (5751)Time elapsed: 0.004 s
% 0.15/0.39 % (5751)Instructions burned: 3 (million)
% 0.15/0.39 % (5751)------------------------------
% 0.15/0.39 % (5751)------------------------------
% 0.15/0.39 % (5755)Instruction limit reached!
% 0.15/0.39 % (5755)------------------------------
% 0.15/0.39 % (5755)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5755)Termination reason: Unknown
% 0.15/0.39 % (5755)Termination phase: Unused predicate definition removal
% 0.15/0.39
% 0.15/0.39 % (5755)Memory used [KB]: 1023
% 0.15/0.39 % (5755)Time elapsed: 0.004 s
% 0.15/0.39 % (5755)Instructions burned: 3 (million)
% 0.15/0.39 % (5755)------------------------------
% 0.15/0.39 % (5755)------------------------------
% 0.15/0.39 % (5749)Instruction limit reached!
% 0.15/0.39 % (5749)------------------------------
% 0.15/0.39 % (5749)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5749)Termination reason: Unknown
% 0.15/0.39 % (5749)Termination phase: Function definition elimination
% 0.15/0.39
% 0.15/0.39 % (5749)Memory used [KB]: 1023
% 0.15/0.39 % (5749)Time elapsed: 0.004 s
% 0.15/0.39 % (5749)Instructions burned: 4 (million)
% 0.15/0.39 % (5749)------------------------------
% 0.15/0.39 % (5749)------------------------------
% 0.15/0.39 % (5753)Refutation not found, incomplete strategy
% 0.15/0.39 % (5753)------------------------------
% 0.15/0.39 % (5753)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5753)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (5753)Memory used [KB]: 5500
% 0.15/0.39 % (5753)Time elapsed: 0.006 s
% 0.15/0.39 % (5753)Instructions burned: 4 (million)
% 0.15/0.39 % (5753)------------------------------
% 0.15/0.39 % (5753)------------------------------
% 0.15/0.39 % (5750)First to succeed.
% 0.15/0.39 % (5748)Also succeeded, but the first one will report.
% 0.15/0.39 % (5750)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% 0.15/0.39 thf(type_def_6, type, individuals: $tType).
% 0.15/0.39 thf(func_def_1, type, prop_a: $i > $o).
% 0.15/0.39 thf(func_def_2, type, prop_b: $i > $o).
% 0.15/0.39 thf(func_def_3, type, prop_c: $i > $o).
% 0.15/0.39 thf(func_def_4, type, mfalse: $i > $o).
% 0.15/0.39 thf(func_def_5, type, mtrue: $i > $o).
% 0.15/0.39 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_14, type, individuals: $tType).
% 0.15/0.39 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_21, type, rel: $i > $i > $o).
% 0.15/0.39 thf(func_def_22, type, icl_atom: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_23, type, icl_princ: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_24, type, icl_and: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_25, type, icl_or: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_26, type, icl_impl: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_27, type, icl_true: $i > $o).
% 0.15/0.39 thf(func_def_28, type, icl_false: $i > $o).
% 0.15/0.39 thf(func_def_29, type, icl_says: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_30, type, iclval: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_31, type, a: $i > $o).
% 0.15/0.39 thf(func_def_32, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.15/0.39 thf(func_def_47, type, sK1: $i > ($i > $o) > $i).
% 0.15/0.39 thf(func_def_48, type, sK2: $i > ($i > $o) > $i).
% 0.15/0.39 thf(func_def_51, type, ph5: !>[X0: $tType]:(X0)).
% 0.15/0.39 thf(f161,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f159])).
% 0.15/0.39 thf(f159,plain,(
% 0.15/0.39 ($true = $false)),
% 0.15/0.39 inference(superposition,[],[f158,f155])).
% 0.15/0.39 thf(f155,plain,(
% 0.15/0.39 ($false = (a @ sK4))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f154])).
% 0.15/0.39 thf(f154,plain,(
% 0.15/0.39 ($false = ((rel @ sK3 @ sK4) => (a @ sK4)))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f153])).
% 0.15/0.39 thf(f153,plain,(
% 0.15/0.39 ($false = ((^[Y0 : $i]: ((rel @ sK3 @ Y0) => (a @ Y0))) @ sK4))),
% 0.15/0.39 inference(sigma_clausification,[],[f152])).
% 0.15/0.39 thf(f152,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: ((rel @ sK3 @ Y0) => (a @ Y0)))) = $false)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f151])).
% 0.15/0.39 thf(f151,plain,(
% 0.15/0.39 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => (a @ Y1))))) @ sK3) = $false)),
% 0.15/0.39 inference(sigma_clausification,[],[f150])).
% 0.15/0.39 thf(f150,plain,(
% 0.15/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => (a @ Y1)))))))),
% 0.15/0.39 inference(boolean_simplification,[],[f149])).
% 0.15/0.39 thf(f149,plain,(
% 0.15/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => ($false | (a @ Y1))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f118])).
% 0.15/0.39 thf(f118,plain,(
% 0.15/0.39 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2)))) @ Y0)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y2 @ Y4 @ Y5) => (Y3 @ Y5))))))))) @ rel @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ Y0 @ Y1))))) @ ((^[Y0 : $i > $o]: (Y0)) @ a) @ (^[Y0 : $i]: ($false)))) != $true)),
% 0.15/0.39 inference(definition_unfolding,[],[f95,f116,f115,f99,f114])).
% 0.15/0.39 thf(f114,plain,(
% 0.15/0.39 (icl_false = (^[Y0 : $i]: ($false)))),
% 0.15/0.39 inference(definition_unfolding,[],[f82,f104])).
% 0.15/0.39 thf(f104,plain,(
% 0.15/0.39 (mfalse = (^[Y0 : $i]: ($false)))),
% 0.15/0.39 inference(cnf_transformation,[],[f49])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 (mfalse = (^[Y0 : $i]: ($false)))),
% 0.15/0.39 inference(fool_elimination,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (mfalse = (^[X0 : $i] : ($false)))),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',mfalse)).
% 0.15/0.39 thf(f82,plain,(
% 0.15/0.39 (mfalse = icl_false)),
% 0.15/0.39 inference(cnf_transformation,[],[f22])).
% 0.15/0.39 thf(f22,axiom,(
% 0.15/0.39 (mfalse = icl_false)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',icl_false)).
% 0.15/0.39 thf(f99,plain,(
% 0.15/0.39 (icl_princ = (^[Y0 : $i > $o]: (Y0)))),
% 0.15/0.39 inference(cnf_transformation,[],[f71])).
% 0.15/0.39 thf(f71,plain,(
% 0.15/0.39 (icl_princ = (^[Y0 : $i > $o]: (Y0)))),
% 0.15/0.39 inference(fool_elimination,[],[f70])).
% 0.15/0.39 thf(f70,plain,(
% 0.15/0.39 (icl_princ = (^[X0 : $i > $o] : (X0)))),
% 0.15/0.39 inference(rectify,[],[f17])).
% 0.15/0.39 thf(f17,axiom,(
% 0.15/0.39 (icl_princ = (^[X5 : $i > $o] : (X5)))),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',icl_princ)).
% 0.15/0.39 thf(f115,plain,(
% 0.15/0.39 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y2 @ Y4 @ Y5) => (Y3 @ Y5))))))))) @ rel @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ Y0 @ Y1))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f101,f100,f93])).
% 0.15/0.39 thf(f93,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,axiom,(
% 0.15/0.39 ((^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))) = mor)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',mor)).
% 0.15/0.39 thf(f100,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))) = mbox)),
% 0.15/0.39 inference(rectify,[],[f8])).
% 0.15/0.39 thf(f8,axiom,(
% 0.15/0.39 ((^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))) = mbox)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',mbox)).
% 0.15/0.39 thf(f101,plain,(
% 0.15/0.39 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mbox @ rel @ (mor @ Y0 @ Y1))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f69])).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mbox @ rel @ (mor @ Y0 @ Y1))))))),
% 0.15/0.39 inference(fool_elimination,[],[f68])).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i > $o] : (mbox @ rel @ (mor @ X0 @ X1))) = icl_says)),
% 0.15/0.39 inference(rectify,[],[f23])).
% 0.15/0.39 thf(f23,axiom,(
% 0.15/0.39 ((^[X7 : $i > $o, X9 : $i > $o] : (mbox @ rel @ (mor @ X7 @ X9))) = icl_says)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',icl_says)).
% 0.15/0.39 thf(f116,plain,(
% 0.15/0.39 (iclval = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2)))) @ Y0)))),
% 0.15/0.39 inference(definition_unfolding,[],[f86,f103])).
% 0.15/0.39 thf(f103,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f77])).
% 0.15/0.39 thf(f77,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f76])).
% 0.15/0.39 thf(f76,plain,(
% 0.15/0.39 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.15/0.39 inference(rectify,[],[f12])).
% 0.15/0.39 thf(f12,axiom,(
% 0.15/0.39 ((^[X5 : $i > $o] : (! [X6] : (X5 @ X6))) = mvalid)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',mvalid)).
% 0.15/0.39 thf(f86,plain,(
% 0.15/0.39 (iclval = (^[Y0 : $i > $o]: (mvalid @ Y0)))),
% 0.15/0.39 inference(cnf_transformation,[],[f65])).
% 0.15/0.39 thf(f65,plain,(
% 0.15/0.39 (iclval = (^[Y0 : $i > $o]: (mvalid @ Y0)))),
% 0.15/0.39 inference(fool_elimination,[],[f24])).
% 0.15/0.39 thf(f24,axiom,(
% 0.15/0.39 ((^[X0 : $i > $o] : (mvalid @ X0)) = iclval)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',icl_s4_valid)).
% 0.15/0.39 thf(f95,plain,(
% 0.15/0.39 ((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) != $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f78])).
% 0.15/0.39 thf(f78,plain,(
% 0.15/0.39 ((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) != $true)),
% 0.15/0.39 inference(flattening,[],[f52])).
% 0.15/0.39 thf(f52,plain,(
% 0.15/0.39 ~((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f51])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ~(iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.15/0.39 inference(rectify,[],[f29])).
% 0.15/0.39 thf(f29,negated_conjecture,(
% 0.15/0.39 ~(iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.15/0.39 inference(negated_conjecture,[],[f28])).
% 0.15/0.39 thf(f28,conjecture,(
% 0.15/0.39 (iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',untrust)).
% 0.15/0.39 thf(f158,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (a @ X1))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f157])).
% 0.15/0.39 thf(f157,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: ($true)) @ X1) = (a @ X1))) )),
% 0.15/0.39 inference(argument_congruence,[],[f121])).
% 0.15/0.39 thf(f121,plain,(
% 0.15/0.39 (a = (^[Y0 : $i]: ($true)))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f117])).
% 0.15/0.39 thf(f117,plain,(
% 0.15/0.39 (((^[Y0 : $i > $o]: (Y0)) @ a) = (^[Y0 : $i]: ($true)))),
% 0.15/0.39 inference(definition_unfolding,[],[f92,f79,f113])).
% 0.15/0.39 thf(f113,plain,(
% 0.15/0.39 (icl_true = ((^[Y0 : $i > $o]: (Y0)) @ a))),
% 0.15/0.39 inference(definition_unfolding,[],[f83,f99])).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 (icl_true = (icl_princ @ a))),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f27,axiom,(
% 0.15/0.39 (icl_true = (icl_princ @ a))),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',ax1)).
% 0.15/0.39 thf(f79,plain,(
% 0.15/0.39 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.15/0.39 inference(cnf_transformation,[],[f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.15/0.39 inference(fool_elimination,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (mtrue = (^[X0 : $i] : ($true)))),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',mtrue)).
% 0.15/0.39 thf(f92,plain,(
% 0.15/0.39 (mtrue = icl_true)),
% 0.15/0.39 inference(cnf_transformation,[],[f21])).
% 0.15/0.39 thf(f21,axiom,(
% 0.15/0.39 (mtrue = icl_true)),
% 0.15/0.39 file('/export/starexec/sandbox/tmp/tmp.Mkir8JYkwC/Vampire---4.8_5513',icl_true)).
% 0.15/0.39 % SZS output end Proof for Vampire---4
% 0.15/0.39 % (5750)------------------------------
% 0.15/0.39 % (5750)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (5750)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (5750)Memory used [KB]: 5628
% 0.15/0.39 % (5750)Time elapsed: 0.008 s
% 0.15/0.39 % (5750)Instructions burned: 7 (million)
% 0.15/0.39 % (5750)------------------------------
% 0.15/0.39 % (5750)------------------------------
% 0.15/0.39 % (5747)Success in time 0.012 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------